Permutive One-Way Cellular Automata and the Finiteness Problem for Automaton Groups
نویسندگان
چکیده
The decidability of the niteness problem for automaton groups is a well-studied open question on Mealy automata. We connect this question of algebraic nature to the periodicity problem of one-way cellular automata, a dynamical question known to be undecidable in the general case. We provide a rst undecidability result on the dynamics of one-way permutive cellular automata, arguing in favor of the undecidability of the niteness problem for reset Mealy automata.
منابع مشابه
TREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS
In this paper, at first we define the concepts of response function and accessible states of a complete residuated lattice-valued (for simplicity we write $mathcal{L}$-valued) tree automaton with a threshold $c.$ Then, related to these concepts, we prove some lemmas and theorems that are applied in considering some decision problems such as finiteness-value and emptiness-value of recognizable t...
متن کاملA Cellular Automaton Based Algorithm for Mobile Sensor Gathering
In this paper we proposed a Cellular Automaton based local algorithm to solve the autonomously sensor gathering problem in Mobile Wireless Sensor Networks (MWSN). In this problem initially the connected mobile sensors deployed in the network and goal is gather all sensors into one location. The sensors decide to move only based on their local information. Cellular Automaton (CA) as dynamical sy...
متن کاملPartially Permutive Cellular Automata
One dimensional cellular automata are analyzed via their generalized permutivity. Invariant subalphabets provide a systematic way of identifying periodic and aperiodic tilings as well as stationary distributions invariant under the cellular automaton iteration. In the case of several invariant subalphabets a hierarchy of interaction phenomena arise. In particular the interaction of subalphabets...
متن کاملRemarks on permutive cellular automata
We prove that every n-dimensional permutive cellular automaton is conjugate to a one-sided shift with compact set of states. This is a generalization of a theorem of R. Gilman.
متن کاملThe finiteness problem for automaton semigroups is undecidable
The finiteness problem for automaton groups and semigroups has been widely studied, several partial positive results are known. However we prove that, in the most general case, the problem is undecidable. We study the case of automaton semigroups. Given a NW-deterministic Wang tile set, we construct a Mealy automaton, such that the plane admits a valid Wang tiling if and only if the Mealy autom...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017